On the completeness of quantum computation models Pablo Arrighi ´ Ecole normale sup´erieure de Lyon

Source URL: who.rocq.inria.fr

• Mathematical logic
• Applied mathematics
• Computable function
• Recursive set
• Enumeration
• Function
• Numbering
• Church–Turing thesis
• Computability
• Computability theory
• Theory of computation
• Mathematics

MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCEComputation Structures Fall 2008 Quiz #2: October 10, 2008 Name

Source URL: 6004.csail.mit.edu

• Electronic engineering
• Automata theory
• Finite-state machine
• Electronics
• Throughput
• Flip-flop
• State diagram
• State
• Models of computation
• Digital electronics
• Theoretical computer science

BRICS Basic Research in Computer Science BRICS DS-00-7 M. Jurdzi´nski: Games for Verification: Algorithmic Issues

Source URL: www.brics.dk

• Logic in computer science
• Computability theory
• Formal methods
• Model checking
• Theory of computation
• Algorithm
• BRIC
• Halting problem
• Formal verification
• Theoretical computer science
• Applied mathematics
• Mathematics

Data Center Network Throughput Analysis using Queueing Petri Nets Piotr Rygielski and Samuel Kounev Institute for Program Structures and Data Organization, Karlsruhe Institute of Technology (KITKarlsruhe, Germany

Source URL: www.relate-itn.eu

• Probability and statistics
• Models of computation
• Mathematical sciences
• Markov models
• Teletraffic
• Petri net
• Queueing theory
• Traffic generation model
• Simulation
• Statistics
• Operations research
• Stochastic processes

The Halting Problems of Network Stack Insecurity Le n S a s s a m a n , M e r e d i t h L . P a t t e r s o n , Se r g e y B r a t u s , and Anna Shubina Len Sassaman was a PhD

Source URL: static.usenix.org

• Computability theory
• Models of computation
• Turing machine
• Theory of computation
• Turing completeness
• Halting problem
• Universal Turing machine
• Parsing
• Deterministic pushdown automaton
• Theoretical computer science
• Computer science
• Applied mathematics

2001 Paper 4 Question 8 Computation Theory (a) Define precisely what is meant by the following: (i ) f (x1 , x2 , . . . xn ) is a Primitive Recursive (PR) function of arity n. [5 marks]

Source URL: www.cl.cam.ac.uk

A Formalism for Graph Databases and its Model of Computation Juan Reutter and Tony Tan University of Edinburgh Abstract. Graph databases are directed graphs in which the edges are labeled with symbols from a finite alpha

Source URL: web.ing.puc.cl

• Vertex
• Matching
• Matroid theory
• Graph operations
• Skew-symmetric graph
• Graph theory
• Graph
• Directed graph

AICS TECHNICAL Report N0An efficient algorithm for the computation of the reduced determinant for Wilson-Dirac operator

Source URL: www.aics.riken.jp

• Matrix theory
• Numerical linear algebra
• Matrices
• Determinants
• Invertible matrix
• Matrix multiplication
• Matrix
• LU decomposition
• Algebra
• Linear algebra
• Mathematics

POLYA PROBLEM-SOLVING SEMINAR WEEK 3: RECURRENCES BOB HOUGH AND RAVI VAKIL The Rules. These are way too many problems to consider. Just pick a few problems you like and play around with them.

Source URL: math.stanford.edu

• Programming idioms
• Algebra
• Recurrence relation
• Number theory
• Fibonacci number
• Recursion
• Factorial
• Mathematics
• Integer sequences
• Theory of computation

Towards an algebraic classification of recognizable sets of lambda-terms1 Sylvain Salvati INRIA Bordeaux sud-ouest, LaBRI, universit´ e de Bordeaux

Source URL: www.cmi.ac.in

• Models of computation
• Computability theory
• Lambda calculus
• Spectral theory
• Formal language
• Theoretical computer science
• Mathematics
• Applied mathematics